Monotonicity Hints
نویسندگان
چکیده
Yaser S. Abu-Mostafa EE and CS Deptartments California Institute of Technology email: [email protected] A hint is any piece of side information about the target function to be learned. We consider the monotonicity hint, which states that the function to be learned is monotonic in some or all of the input variables. The application of mono tonicity hints is demonstrated on two real-world problemsa credit card application task, and a problem in medical diagnosis. A measure of the monotonicity error of a candidate function is defined and an objective function for the enforcement of monotonicity is derived from Bayesian principles. We report experimental results which show that using monotonicity hints leads to a statistically significant improvement in performance on both problems.
منابع مشابه
Neural Networks for Two-Group Classification Problems with Monotonicity Hints
Neural networks are competitive tools for classification problems. In this context, a hint is any piece of prior side information about the classification. Common examples are monotonicity hints. The present paper focuses on learning vector quantization neural networks and gives a simple, however effective, technique, which guarantees that the predictions of the network obey the required monoto...
متن کاملSome new properties of biharmonic heat kernels
Contrary to the second order case, biharmonic heat kernels are sign-changing. A deep knowledge of their behaviour may however allow to prove positivity results for solutions of the Cauchy problem. We establish further properties of these kernels, we prove some Lorch-Szegö-type monotonicity results and we give some hints on how to obtain similar results for higher polyharmonic parabolic problems.
متن کاملAcquisition Management Under Fluctuating Raw Material Prices
We study a continuous-review acquisition problem, in which the raw material price follows a discrete-state Markov process and demand is compound Poisson. We show that one optimal policy is of the order-up-to type. Under our mean reversion and time continuity conditions, we further show that the order-up-to levels are decreasing at the current price level. At the same time, our computational stu...
متن کاملSum Formula for Maximal Abstract Monotonicity and Abstract Rockafellar’s Surjectivity Theorem
In this paper, we present an example in which the sum of two maximal abstract monotone operators is maximal. Also, we shall show that the necessary condition for Rockafellar’s surjectivity which was obtained in ([19], Theorem 4.3) can be sufficient.
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996